Integrated freight car routing and train scheduling

نویسندگان

چکیده

Abstract Rail freight transportation is involved with highly complex logistical processes and requires a lot of resources such as locomotives or wagons. Thus, cost-efficient strategies for routing cars in cargo network are great interest railway companies. When it comes to single wagon load traffic, trains usually formed by collecting individual into batches at shunting yards, order transport them jointly their destinations. The problem finding optimal routes schedules typically solved two steps: (i) determining the solving Single-freight car (), (ii) deciding on time train scheduling (). Since departure arrival times, well interdependent, one aims solve simultaneously. For smooth convenient operational many companies apply concept matrix. This matrix defines unique between all yards that used shipments. In this work, we present an integrated mathematical model based discretization, solves enforces concept. To best our knowledge, first work combines three aspects. approach tailored Cargo Austria’s (RCA) needs, incorporating capacities, yard restrictions regarding travel times. We perform extensive computational study real-world data provided RCA. Besides performance analyze utilization trains, waiting times cars, number processes.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Concurrent Locomotive Assignment and Freight Train Scheduling

The locomotive assignment and the freight train scheduling are important problems in railway transportation. Freight cars are coupled to form a freight rake. The freight rake becomes a train when a locomotive is coupled to it. The locomotive assignment problem assigns locomotives to a set of freight rakes in a way that, with minimum locomotive deadheading time, rake coupling delay and locomotiv...

متن کامل

Single-Car Routing in Rail Freight Transport

Cars in rail freight service follow prescribed routes from their origin via intermediate shunting yards to their destination. The goal in designing such routes is to reduce the number of trains and their travel distances. Various real-world hard constraints make the problem difficult to formulate and also to solve. We present integer programming formulations for this car routing problem arising...

متن کامل

Scheduling Locomotives and Car Transfers in Freight Transport

We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multi-commodity min-cost flow formulation that is also used for public bus scheduling problems. However, several new aspects have to be additionally taken into account, such as cyclic departures of the trains, time windows on starting and arrival times, network-load depe...

متن کامل

Train Scheduling Problem - Phase II: A Simulation Integrated Genetic AlgorithmSystem

In [1] a feasible timetable generator stochastic simulation modeling framework for the train scheduling problem was developed to obtain a train timetable which includes train arrival and departure times at all visited stations and calculated average train travel time for all trains in the system. In this study, the framework is integrated with a genetic algorithm (GA) in order to get an optimal...

متن کامل

Robust Train Routing and Online Re-scheduling

Train Routing is a problem that arises in the early phase of the passenger railway planning process, usually several months before operating the trains. The main goal is to assign each train a stopping platform and the corresponding arrival/departure paths through a railway station. It is also called Train Platforming when referring to the platform assignment task. Railway stations often repres...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Central European Journal of Operations Research

سال: 2022

ISSN: ['1613-9178', '1435-246X']

DOI: https://doi.org/10.1007/s10100-022-00815-3